Guides and shortcuts in graphs

نویسندگان

  • Henry Martyn Mulder
  • Ladislav Nebeský
چکیده

The geodesic structure of a graphs appears to be a very rich structure. There are many ways to describe this structure, each of which captures only some aspects. Ternary algebras are for this purpose very useful and have a long tradition. We study two instances: signpost systems, and a special case of which, step systems. Signpost systems were already used to characterize graph classes. Here we use these for the study of the geodesic structure of a spanning subgraph F with respect to its host graph G. Such a signpost system is called a guide to (F,G). Our main results are: the characterization of the step system of a cycle, the characterization of guides for spanning trees and hamiltonian cycles.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skimming content not quality: The production of a crowd-sourced database of study notes by university students

Study notes have been used by students for many years for the purposes of revision and selfstudy, enabling them to tackle the most challenging of texts and subject areas. These guides help students to ‘skim-read’ texts whilst allowing them insight into the structure of the plot and the semantics. Teachers are often critical of these guides: they consider them to be ‘shortcuts’ for procrastinati...

متن کامل

Mean-field solution of the small-world network model.

The small-world network model is a simple model of the structure of social networks, which possesses characteristics of both regular lattices and random graphs. The model consists of a one-dimensional lattice with a low density of shortcuts added between randomly selected pairs of points. These shortcuts greatly reduce the typical path length between any two points on the lattice. We present a ...

متن کامل

Clustering using Small World Structure

Small world topology has been receiving much attention recent years. Many real-world graphs actually have a small world topology. In a small world graph, a shortcut plays an important role to make the world small; if shortcuts are eliminated, the graph is separated into clusters. In this paper, I propose a new clustering algorithm by eliminating “shortcuts,” which helps a user understand the gr...

متن کامل

Greedy pathlengths and small world graphs

6 We use matrix analysis to study a cycle plus random, uniform shortcuts—the classic small world model. 7 For such graphs, in addition to the usual edge and vertex information there is an underlying metric that 8 determines distance between vertices. The metric induces a natural greedy algorithm for navigating between 9 vertices and we use this to define a pathlength. This pathlength definition...

متن کامل

The Shortcut Problem - Complexity and Approximation

During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road networks. The most sophisticated methods enhance the graph by inserting shortcuts, i.e. additional edges, that represent shortest paths in the graph. Until now, all existing shortcut-insertion strategies are heuristics and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 313  شماره 

صفحات  -

تاریخ انتشار 2013